Blending Fourier and Chebyshev interpolation
نویسندگان
چکیده
منابع مشابه
Determination of a jump by Fourier and Fourier-Chebyshev series
By observing the equivalence of assertions on determining the jump of a function by its differentiated or integrated Fourier series, we generalize a previous result of Kvernadze, Hagstrom and Shapiro to the whole class of functions of harmonic bounded variation. This is achieved without the finiteness assumption on the number of discontinuities. Two results on determination of ...
متن کاملA Fast Algorithm for Chebyshev, Fourier, and Sine Interpolation onto an Irregular Grid
A Chebyshev or Fourier series may be evaluated on the standard collocation grid by the fast Fourier transform (FFT). Unfortunately, the FFT does not apply when one needs to sum a spectral series at N points which are spaced irregularly. The cost becomes O(N’) operations instead of the FFTs O(N log N). This sort of “off-grid” interpolation is needed by codes which dynamically readjust the grid e...
متن کاملSome Architectures for Chebyshev Interpolation
Digital architectures for Chebyshev interpolation are explored and a variation which is word-serial in nature is proposed. These architectures are contrasted with equispaced system structures. Further, Chebyshev interpolation scheme is compared to the conventional equispaced interpolation vis-á-vis reconstruction error and relative number of samples. It is also shown that the use of a hybrid (o...
متن کاملInterpolation and Almost Interpolation by Weak Chebyshev Spaces
Some new results on univariate interpolation by weak Cheby-shev spaces, using conditions of Schoenberg-Whitney type and the concept of almost interpolation sets, are given. x1. Introduction Let U denote a nite-dimensional subspace of real-valued functions deened on some set K. We are interested in describing those conngurations T = dimU jT = s: T is called an interpolation set (I-set) w.r.t. U....
متن کاملRational Interpolation at Chebyshev points
The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1987
ISSN: 0021-9045
DOI: 10.1016/0021-9045(87)90026-8